Optimizations of a Multi-Agent System for a Real-World Warehouse Problem

Abstract In recent years, many warehouses applied mobile robots to move products from one location another. We focus on a traditional warehouse where agents are humans, and they engaged with tasks navigate the next destination after other. The possible destinations determined at beginning of daily shift. Our real-world client asked us minimize total wage cost, irritation workers because conflicts in their tasks. define heuristic for optimizations splitting orders into carts, defining sequence within assignment carts workers. extend Multi-Agent Path Finding (MAPF) solution techniques. Furthermore, we have implemented our proposal simulation software, run several experiments. According experiments, make-span cost cannot be reduced optimization, however optimization considerably reduces conclude work guideline warehouse.